Bounds on Topology Discovery in the Presence of Byzantine Faults
نویسندگان
چکیده
This report is a companion to another technical report [3] to present the formal proofs that could not fit into the conference proceedings of this article [4] due to space limitations. In this report we revisit the problem of Byzantine-robust topology discovery. We formally state the weak and strong versions of the problem. We focus on non-cryptographic solutions to these problems and explore their bounds. We prove that the weak topology discovery problem is solvable only if the connectivity of the network exceeds the number of faults in the system. Similarly, we show that the strong version of the problem is solvable only if the network connectivity is more than twice the number of faults. April 13, 2006 Technical Report TR-KSU-CS-2006-1
منابع مشابه
Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery
Traditional Byzantine resilient algorithms use 2f+1 vertex disjoint paths to ensure message deliveryin the presence of up to f Byzantine nodes. The question of how these paths are identified is related tothe fundamental problem of topology discovery.Distributed algorithms for topology discovery cope with a never ending task, dealing with frequentchanges in the network topology a...
متن کاملAgreement in synchronous networks with ubiquitous faults
In this paper we are interested in synchronous distributed systems subject to transient and ubiquitous failures. This includes systems where failures will occur on any communication link, systems where every processor will experience at one time or another send or receive failure, etc., and, following a failure, normal functioning resuming after a finite time. Notice that these cases cannot be ...
متن کاملBroadcast Using Certified Propagation Algorithm in Presence of Byzantine Faults
We explore the correctness of the Certified Propagation Algorithm (CPA) [5, 1, 7, 4] in solving broadcast with locally bounded Byzantine faults. CPA allows the nodes to use only local information regarding the network topology. We provide a tight necessary and sufficient condition on the network topology for the correctness of CPA. We also present some simple extensions of this result. ∗This re...
متن کاملODSBR: An On-Demand Secure Byzantine Routing Protocol
A common technique used by routing protocols for ad hoc wireless networks is to establish the routing paths on-demand, as opposed to continually maintaining a complete routing table. Since in an ad hoc network nodes not in direct range communicate via intermediate nodes, a significant concern is the ability to route in the presence of Byzantine failures which include nodes that drop, fabricate,...
متن کاملFormally Verified Byzantine Agreement in Presence of Link Faults
This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that provides different classes of faults for bot...
متن کامل